Attenuation by all-trans-retinoic acid of sodium chloride-enhanced gastric carcinogenesis induced by N-methyl-N′-nitro-N-nitrosoguanidine in Wistar rats

The effect of prolonged administration of all-trans-retinoic acid (RA) on sodium chloride-enhanced gastric carcinogenesis induced by N-methyl-N′-nitro-N-nitrosoguanidine, and the labelling and apoptotic indices and immunoreactivity of transforming growth factor (TGF) α in the gastric cancers was investigated in Wistar rats. After 25 weeks of carcinogen treatment, the rats were given chow pellets containing 10% sodium chloride and subcutaneous injections of RA at doses of 0.75 or 1.5 mg kg−1 body weight every other day. In week 52, oral supplementation with sodium chloride significantly increased the incidence of gastric cancers compared with the untreated controls. Long-term administration of RA at both doses significantly reduced the incidence of gastric cancers, which was enhanced by oral administration of sodium chloride. RA at both doses significantly decreased the labelling index and TGF-α immunoreactivity of gastric cancers, which were enhanced by administration of sodium chloride, and significantly increased the apoptotic index of cancers, which was lowered by administration of sodium chloride. These findings suggest that RA attenuates gastric carcinogenesis, enhanced by sodium chloride, by increasing apoptosis, decreasing DNA synthesis, and reducing TGF-α expression in gastric cancers. © 1999 Cancer Research Campaig

From coinductive proofs to exact real arithmetic: theory and applications

Based on a new coinductive characterization of continuous functions we extract certified programs for exact real number computation from constructive proofs. The extracted programs construct and combine exact real number algorithms with respect to the binary signed digit representation of real numbers. The data type corresponding to the coinductive definition of continuous functions consists of finitely branching non-wellfounded trees describing when the algorithm writes and reads digits. We discuss several examples including the extraction of programs for polynomials up to degree two and the definite integral of continuous maps

Decision Procedure for Entailment of Symbolic Heaps with Arrays

This paper gives a decision procedure for the validity of en- tailment of symbolic heaps in separation logic with Presburger arithmetic and arrays. The correctness of the decision procedure is proved under the condition that sizes of arrays in the succedent are not existentially bound. This condition is independent of the condition proposed by the CADE-2017 paper by Brotherston et al, namely, one of them does not imply the other. For improving efficiency of the decision procedure, some techniques are also presented. The main idea of the decision procedure is a novel translation of an entailment of symbolic heaps into a formula in Presburger arithmetic, and to combine it with an external SMT solver. This paper also gives experimental results by an implementation, which shows that the decision procedure works efficiently enough to use